Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Eléments de l'association

Argentine52
Mario Valencia-Pabon7
Argentine Sauf Mario Valencia-Pabon" 45
Mario Valencia-Pabon Sauf Argentine" 0
Argentine Et Mario Valencia-Pabon 7
Argentine Ou Mario Valencia-Pabon 52
Corpus24195
\n\n\n\n \n

List of bibliographic references

Number of relevant bibliographic references: 7.
Ident.Authors (with country if any)Title
000628 Pablo Torres [Argentine] ; Mario Valencia-Pabon [France]Stable Kneser Graphs are almost all not weakly Hom-Idempotent
000810 Flavia Bonomo [Argentine] ; Guillermo Duran [Argentine] ; Mario Valencia-Pabon [France]Complexity of the cluster deletion problem on some subclasses of chordal graphs
000816 Flavia Bonomo [Argentine] ; Guillermo Duran [Argentine] ; Amedeo Napoli [France] ; Mario Valencia-Pabon [France]A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs
000872 Flavia Bonomo [Argentine] ; Ivo Koch [Argentine] ; Pablo Torres [Argentine] ; Mario Valencia-Pabon [France]k-tuple chromatic number of the cartesian product of graphs
000D24 Flavia Bonomo [Argentine] ; Oliver Schaudt [France] ; Maya Stein [Chili] ; Mario Valencia-Pabon [France]b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
000F46 Pablo Torres [Argentine] ; Mario Valencia-Pabon [France]On the packing chromatic number of hypercubes
000F58 Flavia Bonomo [Argentine] ; Oliver Schaudt [France] ; Maya Stein [Chili] ; Mario Valencia-Pabon [France]b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022